Finding Corresponding Points Based on Bayesian Triangulation

نویسندگان

  • Anand S. Bedekar
  • Robert M. Haralick
چکیده

In this paper, we consider the problems of finding corresponding points from multiple perspective projection images (the correspondence problem), and estimating the 3-D point from which these points have arisen (the triangulation problem). We pose the triangulation problem as that of finding the Bayesian maximum a posteriori estimate of the 3-D point, given its projections in N images, assuming a Gaussian error model for the image point co-ordinates and the camera parameters. We solve this by an iterative steepest descent method. We then consider the correspondence problem as a statistical hypothesis verification problem. Given a set of 2-D points, UndeT the hypothesis that the points are in correspondence, the MAP estimate of the 3-D point is computed. Based on the MAP estimate, we derive a statistical test for verifying this hypothesis. To find sets of corresponding points when multiple points in each of N images are given, we propose a method that does the Bayesian triangulation and hypothesis verification on each N-tuple of points, selecting those that pass the hypothesis test. We characterize the performance of the Bayesian triangulation in terms of the average distance of the triangulated 3D point from the true 3-D point, and of the point correspondence method in terms of its misdetection and false alarm rates.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Bayesian method for triangulation and its application to finding corresponding points

In this paper, the problems of finding corresponding points from multiple perspective projection images, and estimating the 3-D points from which these points have arisen, are addressed. The problem of finding corresponding points is formulated as a hypothesis verification problem. Given a set of 2-D points, one from each of N perspective projection images, under the hypothesis that the points ...

متن کامل

An Evolutionary Algorithm for Bayesian Network Triangulation

The problem of triangulation (decomposition) of Bayesian networks is considered. Triangularity of a Bayesian network is required in a general evidence propagation scheme on this network. Finding an optimal triangulation is NP-hard. A local search heuristic based on the idea of evolutionary algorithms is presented. The results obtained using existing and proposed approaches are compared on a bas...

متن کامل

Triangulation of Moral Graph Using Bayesian Optimization Algorithm

Finding the optimistic triangulation in Bayesian network, is NP hard. Bayesian Optimization Algorithm is a new kind of evolutionary algorithm estimation of distribution algorithms (EDAs). An improved BOA is proposed to get approximate optimistic triangulation in this paper. We carry out four EDAs including our method, on four standard Bayesian networks. Comparing with other Estimation of distri...

متن کامل

Triangulation for Points on Lines

Triangulation consists in finding a 3D point reprojecting the best as possible onto corresponding image points. It is classical to minimize the reprojection error, which, in the pinhole camera model case, is nonlinear in the 3D point coordinates. We study the triangulation of points lying on a 3D line, which is a typical problem for Structure-FromMotion in man-made environments. We show that th...

متن کامل

Efficient Three-view Triangulation Based on 3D Optimization

Triangulation of a 3D point from two or more views can be solved in several ways depending on how perturbations in the image coordinates are dealt with. A common approach is optimal triangulation which minimizes the total L2 reprojection error in the images, corresponding to finding a maximum likelihood estimate of the 3D point assuming independent Gaussian noise in the image spaces. Computatio...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996